Output-Sensitive Peeling of Convex and Maximal Layers

We give an output-sensitive algorithm to compute the first k convex or maximal layers in 0( n log I&) -time where Hk is the number of points participating in the first k layers. Computing only the first k layers is interesting in various problems that arise in computational geometry (k-sets and dually k-levels, k-hulls and dually k-belts), pattern recognition, statistics, operations research, etc.